Optimal encoding in stochastic latent-variable Models

نویسندگان

  • M. E. Rule
  • M. Sorbaro
  • M. H. Hennig
چکیده

We examine the problem of optimal sparse encoding of sensory stimuli by latent variables in stochastic models. Analyzing restricted Boltzmann machines with a communications theory approach, we search for the minimal model size that correctly conveys the correlations in stimulus paŠerns in an information-theoretic sense. We show that the Fisher information Matrix (FIM) reveals the optimal model size. In larger models the FIM reveals that irrelevant parameters are associated with individual latent variables, displaying a surprising amount of order. For well-€t models, we observe the emergence of statistical criticality as diverging generalized susceptibility of the model. In this case, an encoding strategy is adopted where highly informative, but rare stimuli selectively suppress variability in the encoding units. Œe information content of the encoded stimuli acts as an unobserved variable leading to criticality. Together, these results can explain the stimulus-dependent variability suppression observed in sensory systems, and suggest a simple, correlation-based measure to reduce the size of arti€cial neural networks. Signi€cance Currently liŠle is known about the statistical structure of representations in stochastic latent encoders, which serve as models of neuronal sensory systems and are widely used in machine learning. Using approaches from statistical physics and information theory, we show that it is possible to evaluate an optimal size of the latent space, and observe emergence of statistical criticality at this model size. Criticality corresponds to an encoding strategy for handling variable information-content of stimuli in a stochastic channel with a €xed hidden-layer size. Œese results yield testable hypotheses about encoding in neuronal sensory systems, and suggest strategies for improving machine learning models. ar X iv :1 80 2. 10 36 1v 1 [ qbi o. N C ] 2 8 Fe b 20 18

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-Dimensional Variance-Reduced Stochastic Gradient Expectation-Maximization Algorithm

We propose a generic stochastic expectationmaximization (EM) algorithm for the estimation of high-dimensional latent variable models. At the core of our algorithm is a novel semi-stochastic variance-reduced gradient designed for the Qfunction in the EM algorithm. Under a mild condition on the initialization, our algorithm is guaranteed to attain a linear convergence rate to the unknown paramete...

متن کامل

Recurrent Ladder Networks

We propose a recurrent extension of the Ladder networks [22] whose structure is motivated by the inference required in hierarchical latent variable models. We demonstrate that the recurrent Ladder is able to handle a wide variety of complex learning tasks that benefit from iterative inference and temporal modeling. The architecture shows close-to-optimal results on temporal modeling of video da...

متن کامل

System Identiication by Dynamic Factor Models

This paper concerns the modelling of stochastic processes by means of dynamic factor models. In such models the observed process is decomposed into a structured part called the latent process, and a remainder that is called noise. The observed variables are treated in a symmetric way, so that no distinction between inputs and outputs is required. This motivates the condition that also the prior...

متن کامل

Using multivariate generalized linear latent variable models to measure the difference in event count for stranded marine animals

BACKGROUND AND OBJECTIVES: The classification of marine animals as protected species makes data and information on them to be very important. Therefore, this led to the need to retrieve and understand the data on the event counts for stranded marine animals based on location emergence, number of individuals, behavior, and threats to their presence. Whales are g...

متن کامل

Application of Stochastic Optimal Control, Game Theory and Information Fusion for Cyber Defense Modelling

The present paper addresses an effective cyber defense model by applying information fusion based game theoretical approaches‎. ‎In the present paper, we are trying to improve previous models by applying stochastic optimal control and robust optimization techniques‎. ‎Jump processes are applied to model different and complex situations in cyber games‎. ‎Applying jump processes we propose some m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018